regexp/syntax.parser.stack (field)

50 uses

	regexp/syntax (current package)
		parse.go#L128: 	stack       []*Regexp // stack of parsed expressions
		parse.go#L201: 		for _, re := range p.stack {
		parse.go#L265: 		for _, re := range p.stack {
		parse.go#L326: 	p.stack = append(p.stack, re)
		parse.go#L341: 	n := len(p.stack)
		parse.go#L346: 	re1 := p.stack[n-1]
		parse.go#L347: 	re2 := p.stack[n-2]
		parse.go#L363: 	p.stack = p.stack[:n-1]
		parse.go#L421: 	n := len(p.stack)
		parse.go#L425: 	sub := p.stack[n-1]
		parse.go#L436: 	p.stack[n-1] = re
		parse.go#L484: 	i := len(p.stack)
		parse.go#L485: 	for i > 0 && p.stack[i-1].Op < opPseudo {
		parse.go#L488: 	subs := p.stack[i:]
		parse.go#L489: 	p.stack = p.stack[:i]
		parse.go#L503: 	i := len(p.stack)
		parse.go#L504: 	for i > 0 && p.stack[i-1].Op < opPseudo {
		parse.go#L507: 	subs := p.stack[i:]
		parse.go#L508: 	p.stack = p.stack[:i]
		parse.go#L1093: 		p.stack = p.stack[:len(p.stack)-1]
		parse.go#L1097: 	n := len(p.stack)
		parse.go#L1101: 	return p.stack[0], nil
		parse.go#L1376: 	n := len(p.stack)
		parse.go#L1377: 	if n >= 3 && p.stack[n-2].Op == opVerticalBar && isCharClass(p.stack[n-1]) && isCharClass(p.stack[n-3]) {
		parse.go#L1378: 		re1 := p.stack[n-1]
		parse.go#L1379: 		re3 := p.stack[n-3]
		parse.go#L1383: 			p.stack[n-3] = re3
		parse.go#L1387: 		p.stack = p.stack[:n-1]
		parse.go#L1392: 		re1 := p.stack[n-1]
		parse.go#L1393: 		re2 := p.stack[n-2]
		parse.go#L1398: 				cleanAlt(p.stack[n-3])
		parse.go#L1400: 			p.stack[n-2] = re1
		parse.go#L1401: 			p.stack[n-1] = re2
		parse.go#L1413: 		p.stack = p.stack[:len(p.stack)-1]
		parse.go#L1417: 	n := len(p.stack)
		parse.go#L1421: 	re1 := p.stack[n-1]
		parse.go#L1422: 	re2 := p.stack[n-2]
		parse.go#L1423: 	p.stack = p.stack[:n-2]